- irreducible refinement
- Математика: неприводимое измельчение
Универсальный англо-русский словарь. Академик.ру. 2011.
irreducible refinement
Смотреть что такое "irreducible refinement" в других словарях:
Lattice (order) — See also: Lattice (group) The name lattice is suggested by the form of the Hasse diagram depicting it. Shown here is the lattice of partitions of a four element set {1,2,3,4}, ordered by the relation is a refinement of . In mathematics, a… … Wikipedia
Modular representation theory — is a branch of mathematics, and that part of representation theory that studies linear representations of finite group G over a field K of positive characteristic. As well as having applications to group theory, modular representations arise… … Wikipedia
Zariski topology — In algebraic geometry, the Zariski topology is a particular topology chosen for algebraic varieties that reflects the algebraic nature of their definition. It is due to Oscar Zariski and took a place of particular importance in the field around… … Wikipedia
Europe, history of — Introduction history of European peoples and cultures from prehistoric times to the present. Europe is a more ambiguous term than most geographic expressions. Its etymology is doubtful, as is the physical extent of the area it designates.… … Universalium
Characters of Shakespear's Plays — … Wikipedia
Space group — In mathematics and geometry, a space group is a symmetry group, usually for three dimensions, that divides space into discrete repeatable domains. In three dimensions, there are 219 unique types, or counted as 230 if chiral copies are considered… … Wikipedia
mysticism — /mis teuh siz euhm/, n. 1. the beliefs, ideas, or mode of thought of mystics. 2. a doctrine of an immediate spiritual intuition of truths believed to transcend ordinary understanding, or of a direct, intimate union of the soul with God through… … Universalium
Shor's algorithm — Shor s algorithm, first introduced by mathematician Peter Shor, is a quantum algorithm for integer factorization. On a quantum computer, to factor an integer N, Shor s algorithm takes polynomial time in log{N}, specifically O((log{N})^3),… … Wikipedia
List of mathematics articles (S) — NOTOC S S duality S matrix S plane S transform S unit S.O.S. Mathematics SA subgroup Saccheri quadrilateral Sacks spiral Sacred geometry Saddle node bifurcation Saddle point Saddle surface Sadleirian Professor of Pure Mathematics Safe prime Safe… … Wikipedia
Separation axiom — In topology and related fields of mathematics, there are several restrictions that one often makes on the kinds of topological spaces that one wishes to consider. Some of these restrictions are given by the separation axioms. These are sometimes… … Wikipedia
Vitalism — This article is about the non mechanist philosophy. For other uses, see vital (disambiguation). Vitalism, as defined by the Merriam Webster dictionary,[1] is a doctrine that the functions of a living organism are due to a vital principle distinct … Wikipedia
